Grokking Google Coding Interview
Rate this course
Ask Author
Contribute
Back to course home

0% completed

Vote For New Content
Introduction
Who Should Take This Course?
Google Easy
Add Binary (easy)
Solution: Add Binary
Valid Mountain Array (easy)
Solution: Valid Mountain Array
Set Mismatch (easy)
Solution: Set Mismatch
Is Subsequence (easy)
Solution: Is Subsequence
Length of Last Word (easy)
Solution: Length of Last Word
Search Insert Position (easy)
Solution: Search Insert Position
Repeated Substring Pattern (easy)
Solution: Repeated Substring Pattern
Monotonic Array (easy)
Solution: Monotonic Array
Count Nodes Equal to Average of Subtree (easy)
Solution: Count Nodes Equal to Average of Subtree
Find the Difference (easy)
Solution: Find the Difference
How Many Numbers Are Smaller Than the Current Number (easy)
Solution: How Many Numbers Are Smaller Than the Current Number
Binary Tree Paths (easy)
Solution: Binary Tree Paths
Find the Difference of Two Arrays (easy)
Solution: Find the Difference of Two Arrays
Merge Strings Alternately (easy)
Solution: Merge Strings Alternately
Reverse a LinkedList (easy)
Solution: Reverse a LinkedList
Google Medium
Gray Code (medium)
Solution: Gray Code
2 Keys Keyboard (medium)
Solution: 2 Keys Keyboard
Arithmetic Slices (medium)
Solution: Arithmetic Slices
Unique Length-3 Palindromic Subsequences (medium)
Solution: Unique Length-3 Palindromic Subsequences
Minimum Difference Between Largest and Smallest Value in Three Moves (medium)
Solution: Minimum Difference Between Largest and Smallest Value in Three Moves
Letter Combinations of a Phone Number (medium)
Solution: Letter Combinations of a Phone Number
01 Matrix (medium)
Solution: 01 Matrix
Maximum Points You Can Obtain from Cards (medium)
Solution: Maximum Points You Can Obtain from Cards
Strobogrammatic Number II (medium)
Solution: Strobogrammatic Number II
Maximum Length of Semi-Decreasing Subarrays (medium)
Solution: Maximum Length of Semi-Decreasing Subarrays
Minimum Area Rectangle (medium)
Solution: Minimum Area Rectangle
Count Unreachable Pairs of Nodes in an Undirected Graph (medium)
Solution: Count Unreachable Pairs of Nodes in an Undirected Graph
Single Number II (medium)
Solution: Single Number II
4Sum II (medium)
Solution: 4Sum II
Furthest Building You Can Reach (medium)
Solution: Furthest Building You Can Reach
Minimizing Array After Replacing Pairs With Their Product (medium)
Solution: Minimizing Array After Replacing Pairs With Their Product
Fair Distribution of Cookies (medium)
Solution: Fair Distribution of Cookies
Find Leaves of Binary Tree (medium)
Solution: Find Leaves of Binary Tree
Rotate Image (medium)
Solution: Rotate Image
Combination Sum (medium)
Solution: Combination Sum
Implement Trie (Prefix Tree) (medium)
Solution: Implement Trie (Prefix Tree)
Number of Islands (medium)
Solution: Number of Islands
Edit Distance (medium)
Solution: Edit Distance
Container With Most Water (Medium)
Solution: Container With Most Water
Meeting Rooms II (medium)
Solution: Meeting Rooms II
Shortest Subarray with Sum at Least K (hard)
Solution: Shortest Subarray with Sum at Least K
Reverse Pairs (hard)
Solution: Reverse Pairs
Nth Magical Number (hard)
Solution: Nth Magical Number
Candy (hard)
Solution: Candy
Arithmetic Slices II - Subsequence (hard)
Solution: Arithmetic Slices II - Subsequence
Burst Balloons (hard)
Solution: Burst Balloons
Sum of Distances in Tree (hard)
Solution: Sum of Distances in Tree
Maximum Score of a Good Subarray (hard)
Solution: Maximum Score of a Good Subarray
Trapping Rain Water (hard)
Solution: Trapping Rain Water
First Missing Positive (hard)
Solution: First Missing Positive
Furthest Building You Can Reach (medium)

Problem Statement

You are given an array of integers heights, where heights[i] is the height of the ith building, integer bricks, and integer ladders.

You start traveling from the first building and move to the next building by either using bricks or ladders.

Each time you encounter a building taller than the one you're currently on, you have two options:

  • climb up using a fixed amount of bricks for each unit of height difference
  • Or, utilize a ladder to bypass the height difference entirely

Return the index (0-indexed) of the furthest building you can reach if you use the given ladders and bricks optimally.

Examples

Example 1:

  • Input: heights = [4,12,2,7,3,18,20,3,19], bricks = 10, ladders = 2
  • Expected Output: 7
  • Justification:
    • Move from building 0 to 1 using a ladder.
    • Move from building 1 to 2 without using any resources.
    • Move from building 2 to 3 using 5 bricks.
    • Move from building 3 to 4 without using any resources.
    • Move from building 4 to 5 using a ladder.
    • Move from building 5 to 6 using 2 bricks.
    • Move from building 3 to 4 without using any resources.

Example 2:

  • Input: heights = [1,5,1,2,3,4,10000], bricks = 4, ladders = 1
  • Expected Output: 5
  • Justification: Use the ladder for the large jump from 0 to 1. Use bricks for smaller climbs from 1 to 2, 2 to 3, 3 to 4, and 4 to 5. This strategy gets you to the 5th building before running out of resources.

Example 3:

  • Input: heights = [5,1,1,1,1,1,1,1,1,1,20], bricks = 10, ladders = 1
  • Expected Output: 10
  • Justification: Use the ladder for the last large climb from 9 to 10 buildings. Bricks can be used for one of the single-unit climbs if necessary, allowing you to reach the last building.

Try it yourself

Try solving this question here:

Java
Saved to Cloud

. . . .
Solution: 4Sum II
Solution: Furthest Building You Can Reach
Mark as Completed

On this page

Problem Statement

Examples

Try it yourself